Unified parallel encoding and decoding algorithms for Dandelion-like codes
نویسندگان
چکیده
منابع مشابه
Unified parallel encoding and decoding algorithms for Dandelion-like codes
The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these bijections, but no parallel algorithms have been reported. In this paper the first parallel encoding and decoding algorithms for Dandelion-like codes are presented. Namely, a unique encoding algorithm and a unique decoding algorithm, whi...
متن کاملParallel Algorithms for Dandelion-Like Codes
We consider the class of Dandelion-like codes, i.e., a class of bijective codes for coding labeled trees by means of strings of node labels. In the literature it is possible to find optimal sequential algorithms for codes belonging to this class, but, for the best of our knowledge, no parallel algorithm is reported. In this paper we present the first encoding and decoding parallel algorithms fo...
متن کاملParallel Algorithms for Encoding and Decoding Blob Code
A bijective code is a method for associating labeled n-trees to (n − 2)-strings of node labels in such a way that different trees yield different strings and vice versa. For all known bijective codes, optimal sequential encoding and decoding algorithms are presented in literature, while parallel algorithms are investigated only for some of these codes. In this paper we focus our attention on th...
متن کاملParallel Algorithms for Computing Prüfer-Like Codes for Labeled Trees
In 1918 Prüfer showed a one-to-one correspondence between labeled trees on n nodes and sequences of (n 2) node labels, obtained by iteratively deleting the leaf with the smallest label in the current tree and appending the label of the adjacent node to the code. In 1953 Neville proposed two additional methods for encoding a labeled tree of order n into a sequence of (n 2) labels. Recently, yet ...
متن کاملutput Decoding Algorithms for Continuous Decoding of Parallel Concatenated Convolutional Codes
I n this paper we propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel concatenated convolutional codes. They are derived f rom the optimum maximum-a-posteriori algorithm and permit a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes. Two basic versions of the continuous algorithm and their suboptimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2010
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2010.07.003